Montgomery Multiplier for Faster Cryptosystems

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Montgomery-Suitable Cryptosystems

Montgomery’s algorithm [8], hereafter denoted Mn(·, ·), is a process for computing Mn(A,B) = ABN mod n where N is a constant factor depending only on n. Usually, AB mod n is obtained by Mn(Mn(A,B), N −2 mod n) but in this article, we introduce an alternative approach consisting in pre-integrating N into cryptographic keys so that a single Mn(·, ·) will replace directly each modular multiplicati...

متن کامل

Efficient VLSI Architecture for Montgomery Modular Multiplier

Montgomery modular multiplication is used in cryptographic algorithms and digital signal processing application. The main objective is to reduce the delay and area of the Montgomery multipliers while maintaining low hardware complexity. To speed up, high-speed Montgomery modular multiplication algorithms and hardware architectures employ carry-save addition to avoid the carry propagation at eac...

متن کامل

Efficient VLSI Architecture for Montgomery Modular Multiplier

Montgomery modular multiplication is used in cryptographic algorithms and digital signal processing application. The main objective is to reduce the delay and area of the Montgomery multipliers while maintaining low hardware complexity. To speed up, high-speed Montgomery modular multiplication algorithms and hardware architectures employ carry-save addition to avoid the carry propagation at eac...

متن کامل

An Asynchronous Modulo Multiplier for Cryptosystems

A new algorithm for asynchronous modulo multiplication has been devised. A locally synchronous globally asynchronous hardware implementation of the algorithm has been modeled in VHDL. Results show that the developed hardware has a superior AT cost for use with GF(P) elliptic curve cryptosystems.

متن کامل

Towards Faster Cryptosystems, II

We discuss three cryptosystems, NTRU , SPIFI , and ENROOT , that are based on the use of polynomials with restricted coefficients.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Procedia Technology

سال: 2016

ISSN: 2212-0173

DOI: 10.1016/j.protcy.2016.08.123